Mapping matrix multiplication algorithm onto fault-tolerant systolic array
نویسندگان
چکیده
منابع مشابه
Fault-Tolerant Systolic Array Design With Partially- Reconfigurable FPGAs
Partial dynamic reconfiguration, PDR, is an important feature of modern reconfigurable architectures such as the Xilinx Virtex FPGA devices. In this paper we focus on the application of PDR to fault-tolerant systolic arrays in one dimension. Single as well as multiple faults in one or more array processing elements, PEs, are considered. In our approach modular redundancy is not used and the goa...
متن کامل2D matrix multiplication on a 3D systolic array
The introduction of systolic arrays in the late 1970s had an enormous impact on the area of special purpose computing. However, most of the work so far has been done with onedimensional and two-dimensional (2D) systolic arrays. Recent advances in three-<limensional VLSI (3D VLSI) and 3D packaging of2D VLSI components, has made the idea of 3D systolic arrays feasible in the near future. In this ...
متن کاملMapping a single-assignment language onto the Warp systolic array
Single-assignment languages offer the potential to efficiently program parallel processors. This paper discusses issues that arise in mapping SISAL programs onto the Warp TM array, a linear systolic array in use at Carnegie Mellon. A Warp machine with ten cells can deliver up to 100 million floating point operations per second. The paper begins with a discussion of systolic arrays as targets fo...
متن کاملHyper-Systolic Matrix Multiplication
A novel parallel algorithm for matrix multiplication is presented. The hyper-systolic algorithm makes use of a one-dimensional processor abstraction. The procedure can be implemented on all types of parallel systems. It can handle matrix-vector multiplications as well as transposed matrix products.
متن کاملFault-Tolerant High-Performance Matrix Multiplication: Theory and Practice
In this paper, we extend the theory and practice regarding algorithmic fault-tolerant matrix-matrix multiplication, C = AB, in a number of ways. First, we propose low-overhead methods for detecting errors introduced not only in C but also in A and/or B. Second, we show that, theoretically, these methods will detect all errors as long as only one entry is corrupted. Third, we propose a low-overh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2004
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2002.12.016